Fast Strategies in Waiter-Client Games
نویسندگان
چکیده
منابع مشابه
Waiter-Client and Client-Waiter Colourability and k-SAT Games
Waiter – Client and Client – Waiter games are two–player, perfect information games, with no chance moves, played on a finite set (board) with special subsets known as the winning sets. Each round of the biased (1 : q) Waiter–Client game begins with Waiter offering q + 1 previously unclaimed elements of the board to Client, who claims one and leaves the remaining q elements to be claimed by Wai...
متن کاملWaiter-Client and Client-Waiter planarity, colorability and minor games
For a finite set X, a family of sets F ⊆ 2X and a positive integer q, we consider two types of two player, perfect information games with no chance moves. In each round of the (1 : q) Waiter-Client game (X,F), the first player, called Waiter, offers the second player, called Client, q + 1 elements of the board X which have not been offered previously. Client then chooses one of these elements w...
متن کاملWaiter-Client and Client-Waiter Hamiltonicity games on random graphs
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph G(n, p). In each round of the (1 : q) Waiter-Client Hamiltonicity game, the first player, called Waiter, offers the second player, called Client, q + 1 edges of G(n, p) which have not been offered previously. Client then chooses one of these edges, which he claim...
متن کاملClient-Waiter Games on Complete and Random Graphs
For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q + 1 unclaimed edges of G from which Client claims one, and the rest are claimed by Waiter. The game ends when all the edges have been claimed. If Client’s graph ...
متن کاملClient-Waiter games on complete and random graphs
For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q + 1 unclaimed edges of G from which Client claims one, and the rest are claimed by Waiter. The game ends when all the edges have been claimed. If Client’s graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9451